#include<iostream>
#include<cstring>

using namespace std;

const int N = 4e5 + 10;

int n, m;
int h[N], e[N], ne[N], idx;
int d[N];
int q[N];

void add(int a, int b){
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx++;
}

bool topologo(){
    int hh = 0, tt = -1;
    for (int i = 1; i <= n; i ++){
        if(!d[i]){
            q[++tt] = i;
        }
    }

    while(hh <= tt){
        int t = q[hh++];

        for (int u = h[t]; u != -1; u = ne[u]){
            int j = e[u];
            d[j]--;
            if(!d[j]){
                q[++tt] = j;
            }
        }
    }

    return tt == n - 1;

}

int main(){
    memset(h, -1, sizeof h);
    cin >> n >> m;

    for (int i = 0; i < m; i ++){
        int a, b;
        cin >> a >> b;
        add(a, b);
        d[b]++;
    }

    if(!topologo())
        cout << "-1" << endl;
    else{
        for (int i = 0; i < n; i ++){
            cout << q[i] << " ";
        }
        cout << endl;
    }

    return 0;
}